Sparse Dictionary Learning for Transient Stability Assessment

نویسندگان

چکیده

Transient stability assessment (TSA) has always been a fundamental and challenging problem for ensuring the security operation of power systems. With more electronic interface resources integrated into grid large renewable energies, system is jeopardized. Therefore, TSA should be considered in advance to keep running stable. In recent years, with development artificial intelligence (AI) technologies such as neural network (ANN), support vector machine (SVM), Markov decision process, improved dramatically. this study, sparse dictionary learning approach proposed improve precision classification accuracy transient Case studies using multi-layer (ML-SVM) long short-term memory network–based recurrent (LSTM-RNN) are discussed benchmarks validate method. The stable unstable learnings designed based on datasets obtained by simulating thousands different time-domain simulation (TDS) scenarios performed New-England 39-bus PSAT (power analysis toolbox) toolbox. Stable dictionaries developed K-SVD approach. testing dataset contains both samples which steps coding process obtain indexes. Compared indexes, system’s final targeted. method exhibits satisfactory prediction provides ability reduce false alarms positives negatives system.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Sparse Dictionary Learning

Sparse coding plays a key role in high dimensional data analysis. One critical challenge of sparse coding is to design a dictionary that is both adaptive to the training data and generalizable to unseen data of same type. In this paper, we propose a novel dictionary learning method to build an adaptive dictionary regularized by an a-priori over-completed dictionary. This leads to a sparse struc...

متن کامل

Greedy algorithms for Sparse Dictionary Learning

Background. Sparse dictionary learning is a kind of representation learning where we express the data as a sparse linear combination of an overcomplete basis set. This is usually formulated as an optimization problem which is known to be NP-Hard. A typical solution uses a two-step iterative procedure which involves either a convex relaxation or some clustering based solution. One problem with t...

متن کامل

Dictionary Learning for L1-Exact Sparse Coding

We have derived a new algorithm for dictionary learning for sparse coding in the l1 exact sparse framework. The algorithm does not rely on an approximation residual to operate, but rather uses the special geometry of the l1 exact sparse solution to give a computationally simple yet conceptually interesting algorithm. A self-normalizing version of the algorithm is also derived, which uses negati...

متن کامل

Accelerated Dictionary Learning for Sparse Signal Representation

Learning sparsifying dictionaries from a set of training signals has been shown to have much better performance than pre-designed dictionaries in many signal processing tasks, including image enhancement. To this aim, numerous practical dictionary learning (DL) algorithms have been proposed over the last decade. This paper introduces an accelerated DL algorithm based on iterative proximal metho...

متن کامل

Proximal Methods for Sparse Hierarchical Dictionary Learning

We propose to combine two approaches for modeling data admitting sparse representations: on the one hand, dictionary learning has proven effective for various signal processing tasks. On the other hand, recent work on structured sparsity provides a natural framework for modeling dependencies between dictionary elements. We thus consider a tree-structured sparse regularization to learn dictionar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers in Energy Research

سال: 2022

ISSN: ['2296-598X']

DOI: https://doi.org/10.3389/fenrg.2022.932770